云计算安全协议设计

分析了目前云计算服务中存在的应用风险和安全隐患,并将其抽象为两方面的问题,即安全边界问题和用户服务资源映射问题。为了解决这两个方面的问题,根据云计算系统的实际需求,给出云计算服务的一种普适性的定义;在此定义基础上,提出了云计算服务的安全框架,并设计了云计算服务各层协议集合。在这个框架和协议集合下,分析了保证云计算服务正常执行所需的四方面要素,以及将诸要素较好地整合在一起的方法。     

军事通信领域上下文本体建模及不确定性推理

为支持军事通信业务的智能化,研究了军事通信业务上下文信息的表示和推理,提出了一种表示业务上下文信息的语法结构、语义以及上下文元信息的本体建模方法。并利用贝叶斯网络理论,提出了一种支持不确定性推理的业务上下文认知模型的构建方法,最后通过案例分析验证了模型和结论的合理性。     

Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A1 Qaeda and the radical Islamic challenge to western strategy

The September 11 global crisis prompted by the attacks on the World Trade Center and the Pentagon raises major questions concerning the nature and trajectory of terrorism in the post-Cold War global order. Hitherto, terrorism has been largely debated by analysts at the level of nation states. Terrorist and insurgent movements have also been largely anchored in nationalist and ethnic power bases even when they have sought to mobilise a transnational ideological appeal on religious or class grounds. There have been a few exceptions to this pattern such as the alliance between the German Baader-Meinhof group and the Japanese Red Army Faction, but even such international alliances as this did not, until at least the 1980s, presage anything like a global terrorist network necessitating a global strategic response. This study examines terrorism and global strategic responses.     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

基于粗糙集理论的定性推理结果的约束

从分析定性推理结果存在的问题出发,提出定性约束的必要性.总结了几种现有的定性约束,提出一种新的定性约束-粗糙定性约束,利用粗糙集属性约简算法对定性推理结果进行约简.简要介绍了粗糙定性推理软件的总体设计思路流程和功能模块划分.以物资供应保障过程定性推理结果为例,对所得推理结果进行粗糙定性约束,得到重要推理结果,为物资供应保障决策提供参考意见.     

任务驱动下航材需求量的GA-GM-BP预测

机务保障影响着航空装备战斗力的生成,机务保障资源是任务成功率的物质支撑.基于航材需求信息的灰色性,通过采用DEMATEL方法提取影响航空备件需求量的关键影响因素,采用遗传算法优化的灰色神经网络对需求量进行了仿真预测,其预测精度较BP神经网络和灰色神经网络都高.该方法对于其他航空机务保障资源的需求预测有借鉴意义.     

基于遗传算法的多功能电子系统任务调度

雷达、通信、电子战等多功能一体化是未来作战平台电子系统的发展方向之一,任务优化调度技术是多功能电子系统的关键技术。针对多功能电子系统射频任务调度问题,在建立任务调度数学模型的基础上,采用了改进的遗传算法对模型进行了求解,提出了任务列表和随机键结合的编码方式,设计了以执行时间最短和任务丢失率最小为目标的多目标适应度函数,采用轮盘赌选择、改进型双点交叉和对称交换变异方式设计遗传操作。通过仿真实验,验证了所设计任务调度方法的有效性和优越性。     

资源约束条件下的空中兵力编组

通过对空中兵力的合理编组,实现作战资源的优化配置是提升兵力作战效能的有效途径。针对现代空战编队对抗过程的特点,从战术企图和信息优势角度提出了编队目标威胁评估方法。以编队目标为研究对象从宏观上调配己方作战资源,提出了作战资源成本和兵力调度成本2种兵力编组成本,在此基础上建立了资源约束条件下的兵力编组优化模型,并采用改进PSO算法对模型进行求解。作战想定仿真结果表明兵力编组模型能够有效解决空战兵力分配问题。     

Keep the change: Counterinsurgency,Iraq, and historical understanding

This article explores the historical reasoning behind counterinsurgency thinking, particularly as applied to Iraq, using Douglas Porch's book, Counterinsurgency: Exposing the Myths of the New Way of War as a reference point. It argues that the classic historical analogies of counterinsurgency theory were inapt in dealing with the conflict in Iraq, and that the historical reasoning behind counterinsurgency more generally deserves greater scrutiny. Not only are the analogies of questionable applicability, but the evidence of causation in prior conflicts is ultimately unproveable. In the end, Counterinsurgency theory and the US Army's Field Manual 3-24 on Counterinsurgency were politically useful during the ‘Surge’, beginning in 2007, but remain intellectually and historically problematic.